Search for: All records

Hyperuniformity, which is a type of long-range order that is characterized by the suppression of long-range density fluctuations in comparison to the fluctuations in standard disordered systems, has emerged as a powerful concept to aid in the understanding of diverse natural and engineered phenomena. In the present paper, we harness hyperuniform point patterns to generate a class of disordered, spatially embedded networks that are distinct from both perfectly ordered lattices and uniformly random geometric graphs. We refer to these networks as \emph{hyperuniform-point-pattern-induced (HuPPI) networks}, and we compare them to their counterpart \emph{Poisson-point-pattern-induced (PoPPI) networks}. By computing the local geometric and transport properties of HuPPI networks, we demonstrate how hyperuniformity imparts advantages in both transport efficiency and robustness. Specifically, we show that HuPPI networks have systematically smaller total effective resistances, slightly faster random-walk mixing times, and fewer extreme-curvature edges than PoPPI networks. Counterintuitively, we also find that HuPPI networks simultaneously have more negative mean Ollivier--Ricci curvatures and smaller global resistances than PoPPI networks, indicating that edges with moderately negative curvatures need not create severe bottlenecks to transport. We also demonstrate that the network-generation method strongly influences these properties and in particular that it often overshadows differences that arise from underlying point patterns. These results collectively demonstrate potential advantages of hyperuniformity in network design and motivate further theoretical and experimental exploration of HuPPI networks. 

In traditional models of opinion dynamics, each agent in a network has an opinion and changes in opinions arise from pairwise (i.e., dyadic) interactions between agents. However, in many situations, groups of individuals possess a collective opinion that can differ from the opinions of their constituent individuals. In this paper, we study the effects of group opinions on opinion dynamics. We formulate a hypergraph model in which both individual agents and groups of three agents have opinions, and we examine how opinions evolve through both dyadic interactions and group memberships. We find for some parameter values that the presence of group opinions can lead to oscillatory and excitable opinion dynamics. In the oscillatory regime, the mean opinion of the agents in a network has self-sustained oscillations. In the excitable regime, finite-size effects create large but short-lived opinion swings (as in social fads). We develop a mean-field approximation of our model and obtain good agreement with direct numerical simulations. We also show—both numerically and via our mean-field description—that oscillatory dynamics occur only when the numbers of dyadic and polyadic interactions of the agents are not completely correlated. Our results illustrate how polyadic structures, such as groups of agents, can have important effects on collective opinion dynamics. 

People sometimes change their opinions when they discuss things with each other. Researchers can use mathematics to study opinion changes in simplifications of real-life situations. These simplified scenarios, which are examples of mathematical models, help researchers explore how people influence each other through their social interactions. In today’s digital world, these models can help us learn how to promote the spread of accurate information and reduce the spread of inaccurate information. In this article, we discuss a simple mathematical model of opinion changes that arise from social interactions. We briefly describe what opinion models can tell us and how researchers try to make them more realistic. 

Abstract Susceptibility to infectious diseases such as COVID-19 depends on how those diseases spread. Many studies have examined the decrease in COVID-19 spread due to reduction in travel. However, less is known about how much functional geographic regions, which capture natural movements and social interactions, limit the spread of COVID-19. To determine boundaries between functional regions, we apply community-detection algorithms to large networks of mobility and social-media connections to construct geographic regions that reflect natural human movement and relationships at the county level in the coterminous United States. We measure COVID-19 case counts, case rates, and case-rate variations across adjacent counties and examine how often COVID-19 crosses the boundaries of these functional regions. We find that regions that we construct using GPS-trace networks and especially commute networks have the lowest COVID-19 case rates along the boundaries, so these regions may reflect natural partitions in COVID-19 transmission. Conversely, regions that we construct from geolocated Facebook friendships and Twitter connections yield less effective partitions. Our analysis reveals that regions that are derived from movement flows are more appropriate geographic units than states for making policy decisions about opening areas for activity, assessing vulnerability of populations, and allocating resources. Our insights are also relevant for policy decisions and public messaging in future emergency situations. 

Abstract Researchers in many fields use networks to represent interactions between entities in complex systems. To study the large-scale behavior of complex systems, it is useful to examine mesoscale structures in networks as building blocks that influence such behavior. In this paper, we present an approach to describe low-rank mesoscale structures in networks. We find that many real-world networks possess a small set of latent motifs that effectively approximate most subgraphs at a fixed mesoscale. Such low-rank mesoscale structures allow one to reconstruct networks by approximating subgraphs of a network using combinations of latent motifs. Employing subgraph sampling and nonnegative matrix factorization enables the discovery of these latent motifs. The ability to encode and reconstruct networks using a small set of latent motifs has many applications in network analysis, including network comparison, network denoising, and edge inference.